Unit Memory Convolutional Codes with Maximum Distance
نویسنده
چکیده
Unit memory codes and in particular, partial unit memory codes are reviewed. Conditions for the optimality of partial unit memory codes with degree k− 1 are given, where optimal codes are the codes having the maximum free distance among all codes of the same parameters k,n and degree μ. A binary construction of unit memory codes with μ = k − 1 is discussed for the cases that satisfy the optimality conditions. This construction is generalized for codes over fields of characteristic p > 2.
منابع مشابه
Construction of Unit-Memory MDS Convolutional Codes
Maximum-distance separable (MDS) convolutional codes form an optimal family of convolutional codes, the study of which is of great importance. There are very few general algebraic constructions of MDS convolutional codes. In this paper, we construct a large family of unit-memory MDS convolutional codes over Fq with flexible parameters. Compared with previous works, the field size q required to ...
متن کاملConvolutional Codes Derived From Group Character Codes
Constructions of (classical) convolutional codes and their corresponding properties have been presented in the literature [1, 3–8, 12, 15–20]. In [3], the author constructed an algebraic structure for convolutional codes. Addressing the construction of maximum-distance-separable (MDS) convolutional codes (in the sense that the codes attain the generalized Singleton bound introduced in [18, Theo...
متن کاملOn (Partial) Unit Memory Codes Based on Gabidulin Codes
Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so–called sum rank metric. For the sum rank metric, the free rank distance, the extended row ran...
متن کاملQuasi-cyclic unit memory convolutional codes
Unit memory convolutional codes with generator matrices, which are composed of circulant suhmatrices, are introduced. This structure facilitates the analysis as well as an efficient search for good codes. Equivalences among such codes and consider some of the basic structural properties are discussed. In particular, catastrophic encoders and minimal encoders are characterized and dual codes tre...
متن کاملConvolutional codes with maximum distance profile
Maximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other convolutional code of the same rate and degree. In this paper we use methods from systems theory to characterize maximum distance profile codes algebraically. The main r...
متن کامل